On Duality Concepts regarding Hypergraphs and Propositional Formulas
نویسنده
چکیده
There is a well known duality concept in propositional logic (cf. e.g. [3, 14]) essentially relating CNF formulas to tautologically equivalent DNF formulas. In this paper we propose and discuss another duality principle in propositional logic based on a set theoretic duality interchanging clauses and literals, thus working for arbitrary normal form formulas. This concept is closely related to a set theoretic approach to hypergraph duality which is discussed in
منابع مشابه
1 Directed Hypergraphs and Applications ( * )
We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented. Algorithms to perform visits of hypergraphs and to find optimal paths are studied in detail. Some applica...
متن کاملConstruction of a Non-2-colorable k-uniform Hypergraph with Few Edges
We show how to construct a non-2-colorable k-uniform hypergraph with (2) edges. By the duality of hypergraphs and monotone CNF-formulas this gives an unsatisfiable monotone k-CNF with (2) clauses.
متن کاملXSAT and NAE-SAT of linear CNF classes
XSAT and NAE-SAT are important variants of the propositional satisfiability problem (SAT). Both are studied here regarding their computational complexity of linear CNF formulas. We prove that both variants remain NP-complete for (monotone) linear formulas yielding the conclusion that also bicolorability of linear hypergraphs is NP-complete. The reduction used gives rise to the complexity invest...
متن کاملDeciding Hypergraph 2-Colourability by H-Resolution
Deciding whether a hypergraph is 2-colourable is a computational problem which contains the satisfiability problem in propositional calculus as a special case. We present a method for deciding the 2-colourability of hypergraphs. This method which we call H-resolution is closely related to resolution of boolean formulas and the relation.between the two is investigated.
متن کاملDeciding Monotone Duality and Identifying Frequent Itemsets
The monotone duality problem is defined as follows: Given two monotone formulas f and g in irredundant DNF, decide whether f and g are dual. This problem is the same as duality testing for hypergraphs, that is, checking whether a hypergraph H consists of precisely all minimal transversals of a hypergraph G. By exploiting a recent problemdecomposition method by Boros and Makino (ICALP 2009), we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014